Deducing the Multidimensional Szemerédi Theorem from an Infinitary Removal Lemma

نویسنده

  • Tim Austin
چکیده

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T1, T2, . . . , Td : Z y (X,Σ, μ) ([6]), and so, via the Furstenberg correspondence principle introduced in [5], a new proof of the multi-dimensional Szemerédi Theorem. We bypass the careful manipulation of certain towers of factors of a probability-preserving system that underlies the FurstenbergKatznelson analysis, instead modifying an approach recently developed in [1] to pass to a large extension of our original system in which this analysis greatly simplifies. The proof is then completed using an adaptation of arguments developed by Tao in [13] for his study of an infinitary analog of the hypergraph removal lemma. In a sense, this addresses the difficulty, highlighted by Tao, of establishing a direct connection between his infinitary, probabilistic approach to the hypergraph removal lemma and the infinitary, ergodic-theoretic approach to Szemerédi’s Theorem set in motion by Furstenberg [5].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deducing the Multidimensional Szemerédi Theorem from the Infinitary Hypergraph Removal Lemma

We offer a new proof of the Furstenberg-Katznelson multiple recurrence theorem for several commuting probability-preserving transformations T1, T2, . . . , Td : Z y (X,Σ, μ) ([5]), and so, via the Furstenberg correspondence principle introduced in [4], a new proof of the multi-dimensional Szemerédi Theorem. We bypass the detailed analysis of certain towers of factors of a probability-preserving...

متن کامل

Deducing the Density Hales-Jewett Theorem from an infinitary removal lemma

We offer a new proof of Furstenberg and Katznelson’s density version of the Hales-Jewett Theorem: Theorem. For any δ > 0 there is some N0 ≥ 1 such that whenever A ⊆ [k] with N ≥ N0 and |A| ≥ δk , A contains a combinatorial line: that is, for some I ⊆ [N ] nonempty and w0 ∈ [k] ]\I we have A ⊇ {w : w|[N ]\I = w0, w|I = const.}. Following Furstenberg and Katznelson, we first show that this result...

متن کامل

A Correspondence Principle between (hyper)graph Theory and Probability Theory, and the (hyper)graph Removal Lemma

We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As an application we present a new (infinitary) proof of the hypergraph removal lemma of Nagle-Schacht-Rödl-Skokan and Gowers, which does not require the hyperg...

متن کامل

An Infinitary Version of Sperner's Lemma

We prove an extension of the well-known combinatorial-topological lemma of E. Sperner [20] to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem .

متن کامل

An Infinitary Polynomial van der Waerden Theorem

Our subject is infinitary Ramsey theory, specifically the existence of monochromatic structures of infinite cardinality for finite colorings of semigroups. Specifically, we shall prove an infinitary version of a recent polynomial extension of van der Waerden's theorem due to Bergelson and Leibman ([BL1]). Alternatively, this theorem may be viewed as a polynomial version of an infinitary van der...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009